Chromatic Index of Hypergraphs and Shannon’s Theorem
نویسندگان
چکیده
منابع مشابه
On the Chromatic Index of Random Uniform Hypergraphs
Let H(n,N), where k ≥ 2, be a random hypergraph on the vertex set [n] = {1, 2, . . . , n} with N edges drawn independently with replacement from all subsets of [n] of size k. For d̄ = kN/n and any ε > 0 we show that if k = o(ln(d̄/ lnn)) and k = o(ln(n/ ln d̄)), then with probability 1−o(1) a random greedy algorithm produces a proper edge-colouring of H(n,N) with at most d̄(1+ε) colours. This yield...
متن کاملChromatic polynomials of hypergraphs
In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique. Moreover we give some equalities for the chromatic polynomials of hypergraphs generalizing known results for graphs and hypergraphs of Read and Dohmen.
متن کاملCircular Chromatic Number of Hypergraphs
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic properties. We study the relationship between circular chromatic number with chromatic number and fractional chromatic number of uniform hypergraphs.
متن کاملComplete Subgraphs of Chromatic Graphs and Hypergraphs
In this note we consider k-chromatic graphs with given colour k r-graphs have vertex sets u C i , and no r-tuple (i .e. edge o f 1 the r-graph) has two vertices in the same colour class C i .
متن کاملHypergraphs with Zero Chromatic Threshold
Let F be an r-uniform hypergraph. The chromatic threshold of the family of F free, r-uniform hypergraphs is the infimum of all non-negative reals c such that the subfamily of F -free, r-uniform hypergraphs H with minimum degree at least c (|V (H)| r−1 ) has bounded chromatic number. The study of chromatic thresholds of various graphs has a long history, beginning with the early work of Erdős-Si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2000
ISSN: 0195-6698
DOI: 10.1006/eujc.1999.0388